On simplex method with most-obtuse-angle rule and cosine rule
نویسندگان
چکیده
A class of simplex methods for solving linear programming (LP) problems, with cosine pivot rule, have been presented in some recent papers. In this paper we show that the cosine rule used in this class is equivalent to the mostobtuse-angle pivot rule, proposed by Pan (1990). The relation between the direct method for LP and the most-obtuse-angle rule is discussed.
منابع مشابه
Phase I cycling under the most-obtuse-angle pivot rule
It has been recently claimed that the most-obtuse-angle pivot rule is one of the best choices for Phase I linear programs based on the simplex method. In this short note we give two instances of Phase I cycling under such ratio-test-free rule, both when it is used to obtain primal feasibility and when trying to achieve dual feasibility with its unnormalized counterpart. A crash procedure that i...
متن کاملA basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
The dual Phase-I algorithm using the most-obtuse-angle row pivot rule is very efficient for providing a dual feasible basis, in either the classical or the basisdeficiency-allowing context. In this paper, we establish a basis-deficiency-allowing Phase-I algorithm using the so-called most-obtuse-angle column pivot rule to produce a primal (deficient or full) basis. Our computational experiments ...
متن کاملA Margin-based Model with a Fast Local Searchnewline for Rule Weighting and Reduction in Fuzzynewline Rule-based Classification Systems
Fuzzy Rule-Based Classification Systems (FRBCS) are highly investigated by researchers due to their noise-stability and interpretability. Unfortunately, generating a rule-base which is sufficiently both accurate and interpretable, is a hard process. Rule weighting is one of the approaches to improve the accuracy of a pre-generated rule-base without modifying the original rules. Most of the pro...
متن کاملA Reduced-Order Correction Algorithm for the Linear Programming Problem by Non-negative Constraints with the Most-Obtuse Angle
Based on the linear and geometric-plane features of linear programming, and the consistent quantity of nullelements for all the non-degenerate base-solutions of some linear programming problem, with the help of the new platform, constructed by the conceptions including characteristic matrix of linear programming problem, negative pivoting iteration transformation and so on, a new solution metho...
متن کاملApplication of the rule extraction method to evaluate seismicity of Iran
Assessing seismic hazards involves specifying the likelihood, magnitude and location of earthquakes in a region. Predicting the seismic hazards is the first step in reducing the impact of the damage caused by an earthquake. In this study, to fully utilize all the known parameters which may possibly affect the occurrence of earthquakes (mb ≥ 4.5); a data-driven rule-extraction method called the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 217 شماره
صفحات -
تاریخ انتشار 2011